home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
ftp.cs.arizona.edu
/
ftp.cs.arizona.edu.tar
/
ftp.cs.arizona.edu
/
icon
/
newsgrp
/
group01b.txt
/
000189_icon-group-sender_Mon Dec 10 09:19:34 2001.msg
< prev
next >
Wrap
Internet Message Format
|
2002-01-03
|
2KB
Return-Path: <icon-group-sender>
Received: (from root@localhost)
by baskerville.CS.Arizona.EDU (8.11.1/8.11.1) id fBAGHmQ08451
for icon-group-addresses; Mon, 10 Dec 2001 09:17:48 -0700 (MST)
Message-Id: <200112101617.fBAGHmQ08451@baskerville.CS.Arizona.EDU>
From: espie@schutzenberger.liafa.jussieu.fr (Marc Espie)
X-Newsgroups: comp.lang.icon
Subject: PhD announce
Date: Mon, 10 Dec 2001 15:51:49 +0000 (UTC)
X-Complaints-To: newsmaster@jussieu.fr
X-Newsreader: trn 4.0-test74 (May 26, 2000)
Originator: espie@schutzenberger.liafa.jussieu.fr (Marc Espie)
To: icon-group@cs.arizona.edu
Errors-To: icon-group-errors@cs.arizona.edu
Status: RO
Content-Length: 1623
I'm going to defend my PhD in Paris, on the 18th december.
Everything is in french, the subject roughly translates to
`On some combinatorial problems and implementation aspects'.
As you can see from the abstract, a large portion of this work is derived
from using Icon for combinatorial works. I would like to thank all the
friends I've made in the Icon project over the years.
Abstract:
This work first presents a combinatorial study of the Chinese monoid, a
ternary monoid related to the plactic monoid and based on the rewritings
$cba\equiv bca\equiv cab$. The tools that were developed for this study
(Robinson-Schenstedt correspondence, computation of the order of specific
classes) lead to a generic framework for combinatorial computations.
Some lazy and dynamic evaluation techniques, based upon the notion of
generator, as exemplified by the Icon programming language, allow
the required computations, while generalizing to other problems.
For instance, checking a conjecture over polyzeta was achieved to a larger
order than was previously known. In fact, those techniques are somewhat
independent of the language, as long as one uses some specific apparatus
to translate the generator paradigm into some other language.
Finally, this work presents the classical index assignment problem,
a classical problem in digital telecommunications. Some partial solution
is attained through a new approach merging some heavy-weight numerical
computations and a new approach to the model itself.
(the french manuscript can be retrieved from
http://schutz.liafa.jussieu.fr/espie, if it by chance interests anyone).